Graphical Method of Reversible Circuits Synthesis
نویسندگان
چکیده
منابع مشابه
Automatic Synthesis of Reversible Circuits
The design of reversible systems significantly differs from their conventional counterparts therefore Evolutionary algorithms have been explored in the past for the purpose. In this work, the Enhanced Quantum inspired Evolutionary algorithm is employed for synthesis of various digital and benchmark circuits and its comparative performance analysis with other evolutionary algorithms as well as e...
متن کاملSynthesis of reversible logic circuits
Reversible or information-lossless circuits have applications in digital signal processing, communication, computer graphics, and cryptography. They are also a fundamental requirement in the emerging field of quantum computation. We investigate the synthesis of reversible circuits that employ a minimum number of gates and contain no redundant input–output line-pairs (temporary storage channels)...
متن کاملSynthesis of Genetic Circuits from Graphical Specifications
EDA tools have facilitated the design of ever more complex integrated circuits each year. Synthetic biology would also benefit from the development of genetic design automation (GDA) tools. Existing GDA tools require biologists to design genetic circuits at the molecular level, roughly equivalent to designing electronic circuits at the layout level. Analysis of these circuits is also performed ...
متن کاملSynthesis of Reversible Circuits for Large Reversible Functions
This paper presents a new algorithm MP (multiple pass) to synthesize large reversible binary circuits without ancilla bits. The well-known MMD algorithm for synthesis of reversible circuits requires to store a truth table (or a Reed-Muller RM transform) as a 2n vector to represent a reversible function of n variables. This representation prohibits synthesis of large functions. However, in MP we...
متن کاملEfficient Synthesis of Linear Reversible Circuits
gates. We present an algorithm that is optimal up to a multiplicative constant, as well as Θ(log n) times faster than previous methods. While our results are primarily asymptotic, simulation results show that even for relatively small n our algorithm is faster and yields more efficient circuits than the standard method. Generically our algorithm can be interpreted as a matrix decomposition algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Electronics and Telecommunications
سال: 2017
ISSN: 2300-1933
DOI: 10.1515/eletel-2017-0031